|
In data mining and machine learning, -flats algorithm 〔Bradley, P S, and O L Mangasarian. 2000. k-Plane Clustering. Journal of Global Optimization 16, no. 1: 23-32. http://www.springerlink.com/index/H51L607707062TN7.pdf.〕 〔Tseng, P. 2000. Nearest q-flat to m points. Journal of Optimization Theory and Applications 105, no. 1: 249–252.〕 is an iterative method which aims to partition observations into clusters where each cluster is close to a -flat, where is a given integer. It is a generalization of the -means algorithm. In -means algorithm, clusters are formed in the way that each cluster is close to one point, which is a -flat. -flats algorithm gives better clustering result than -means algorithm for some data set. ==Description== 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「K q-flats」の詳細全文を読む スポンサード リンク
|